Coevolutionary Intransitivity in Games: A Landscape Analysis

نویسنده

  • Hendrik Richter
چکیده

Intransitivity is supposed to be a main reason for deficits in coevolutionary progress and inheritable superiority. Besides, coevolutionary dynamics is characterized by interactions yielding subjective fitness, but aiming at solutions that are superior with respect to an objective measurement. Such an approximation of objective fitness may be, for instance, generalization performance. In the paper a link between rating– and ranking–based measures of intransitivity and fitness landscapes that can address the dichotomy between subjective and objective fitness is explored. The approach is illustrated by numerical experiments involving a simple random game with continuously tunable degree of randomness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic landscape models of coevolutionary games

Players of coevolutionary games may update not only their strategies but also their networks of interaction. Based on interpreting the payoff of players as fitness, dynamic landscape models are proposed. The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth-death (BD) or death-birth (DB) strategy updating. The main focus is on usin...

متن کامل

Focusing versus Intransitivity Geometrical Aspects of Co-evolution

Recently, a minimal domain dubbed the numbers game has been proposed to illustrate well-known issues in co-evolutionary dynamics. The domain permits controlled introduction of features like intransitivity, allowing researchers to understand failings of a co-evolutionary algorithm in terms of the domain. In this paper, we show theoretically that a large class of co-evolution problems closely res...

متن کامل

A New Framework for Analysis of Coevolutionary Systems - Directed Graph Representation and Random Walks.

Studying coevolutionary systems in the context of simplified models (i.e. games with pairwise interactions between coevolving solutions modelled as self plays) re-mains an open challenge since the rich underlying structures associated with pairwise-comparison-based fitness measures are often not taken fully into account. Although cyclic dynamics have been demonstrated in several contexts (such ...

متن کامل

When Coevolutionary Algorithms Exhibit Evolutionary Dynamics

The task of understanding the dynamics of coevolutionary algorithms or comparing performance between such algorithms is complicated by the fact the internal fitness measures are subjective. Though a variety of techniques have been proposed to use external or objective measures to help in analysis, there are clearly properties of fitness payoff (e.g., intransitivity) which call such methods into...

متن کامل

Guaranteeing Coevolutionary Objective Measures

The task of understanding the dynamics of coevolutionary algorithms or comparing performance between such algorithms is complicated by the fact the internal fitness measures are subjective. Though several techniques have been proposed to use external or objective measures to help in analysis, there are clearly properties of fitness payoff, like intransitivity, for which these techniques are ine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015